منابع مشابه
Traversing Directed Eulerian Mazes
The paper describes two algorithms for threading unknown, finite directed Eulerian mazes. Each of these algorithms is performed by a traveling robot whose control is a finite-state automaton. It is assumed that each vertex has a circular list of its outgoing edges. The items of this list are called exits. Each of the algorithms puts in one of the exits of each vertex a scan pebble. These pebble...
متن کاملProgramming random mazes.
Nature is full of algorithms melding deterministic and random processes. For example, pine trees grow following the same underlying genetic rules, yet no two in a forest are exactly the same. In the paper on page 251 we asked ourselves, could these stochastic algorithms provide simple programming rules to make complex structural patterns in a molecular system? Initially, we wanted to build dive...
متن کاملCompass-free Navigation of Mazes
If you find yourself in a corridor of a standard maze, a sure and easy way to escape is to simply pick the left (or right) wall, and then follow it along its twists and turns and around the dead-ends till you eventually arrive at the exit. But what happens when you cannot tell left from right? What if you cannot tell North from South? What if you cannot judge distances, and have no idea what it...
متن کاملSmall worlds, mazes and random walks
– A parametrized family of random walks whose trajectories are easily identified as graphs is presented. This construction shows small-world–like behavior but, interestingly, a power law emerges between the minimal distance L and the number of nodes N of the graph instead of the typical logarithmic scaling. We explain this peculiar finding in the light of the well-known scaling relationships in...
متن کاملSearching Constant Width Mazes Captures theAC Hierarchy
We show that searching a width k maze is complete for Πk, i.e., for the k’th level of the AC0 hierarchy. Equivalently, st-connectivity for width k grid graphs is complete for Πk. As an application, we show that there is a data structure solving dynamic st-connectivity for constant width grid graphs with time boundO(log log n) per operation on a random access machine. The dynamic algorithm is de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1977
ISSN: 0001-8708
DOI: 10.1016/0001-8708(77)90035-4